Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-quantifiers
نویسنده
چکیده
This paper is to contributive to the model theory of ordered abelian groups (o.a.g. for short). The basic elements to build up the algebraic structure of the o.a.g-s are the archimedean groups: By Hahn's embedding theorem every o.a.g. can be represented as a subgroup of the Hahn-product of archimedean o.a.g.s. Archimedean is not a first-order concept but there exists a first-order model theory of o.a.g.-s has to be developed inside the framework of regularly o.a.g-s. Weispfenning [2] showed that these are essentially the ones that admit elimination of quantifiers in the language {+, −, 0, <, ≡ n |n < ω} of o.a.g-s. (possibly extended by a set of constant symbols). Moreover, this quantifier elimination procedure is a basic tool for the model-theoretic investigations in this field. We start to develop the model theory of o.a.g-s inside the framework of extended logics: archimedean is a L(Q n 0)-phenomenon Q n 0 being the " Ramsey quantifier " (in the ℵ 0-interpretation) introduced by Magidor & Malitz [1]. We generalize the quantifier elimination results mentioned above to L(Q n 0) and L <ω 0. Especially, we prove quantifier elimination results for classes of non-archimedean o.a.g.s. Since all these quantifier-elimination procedures are effective, this yields the decidability of the respective theories.
منابع مشابه
Advice Automatic Structures and Uniformly Automatic Classes
We study structures that are automatic with advice. These are structures that admit a presentation by finite automata (over finite or infinite words or trees) with access to an additional input, called an advice. Over finite words, a standard example of a structure that is automatic with advice, but not automatic in the classical sense, is the additive group of rational numbers (Q,+). By using ...
متن کاملBisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملBisimulation Quantified Logics: Undecidability
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...
متن کاملProof theory for lattice-ordered groups
Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-elimination have been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing some family resemblance to groups, such as la...
متن کاملInterpreting Formulas of Divisible Lattice Ordered Abelian Groups - Preliminary Version
We show that a large class of divisible abelian `-groups (lattice ordered groups) of continuous functions is interpretable (in a certain sense) in the lattice of the zero sets of these functions. This has various applications to the model theory of these `-groups, including decidability results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005